import java.util.Scanner;

/**
 * 求最小公倍数
 */
public class LeastCommonMultiple {
    public static void main(String[] args) {
        // 两个数的乘积等于最小公倍数乘以最大公约数
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int num1 = scanner.nextInt();
            int num2 = scanner.nextInt();
            System.out.println((num1*num2)/maxCommonDivisor(num1,num2));
        }
    }

    private static int maxCommonDivisor(int num1, int num2) {
        if (num2==0) {
            return num1;
        } else {
            return maxCommonDivisor(num2, num1 % num2);
        }
    }
}
